Subtyping by Constraints in Object-Oriented Databases

نویسندگان

  • Wolfgang L. J. Kowarschick
  • Gerhard Köstler
  • Werner Kießling
چکیده

For many object-oriented database applications taxonomies with a setinclusion semantics among the type extents are essential. In practical cases, however, common object-oriented modeling techniques often do not result in taxonomies as they ignore application specific constraints. We will elaborate that especially in domains like CAD or similar engineering environments integrity constraints on type attributes have a deep impact on the resulting hierarchy. We argue that subtyping by constraints may be superior to other object-oriented alternatives like subtyping for generalization or nearly-flat hierarchies. Subtyping by constraints achieves a logical set-inclusion hierarchy, and in addition enables a larger amount of semantically correct substitutability. This can even be improved by a novel framework of automatic method adaptation for enhanced substitutability. Moreover, a potential storage penalty caused by making constraints explicit can be avoided completely by applying a new storage optimization technique based on functional integrity constraints. Our results are illustrated by practical examples drawn from the OCAD project.?

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Subtyping Functional+Nonempty Record Types

Solving systems of subtype constraints (or subtype inequalities) is in the core of eecient type reconstruction in modern object-oriented languages with subtyping and inheritance, two problems known polynomial time equivalent. It is important to know how diierent combinations of type constructors innuence the complexity of the problem. We show the NP-hardness of the satissability problem for sub...

متن کامل

Type Inference for the Mixture of Matching and Implicit Subtyping

We present a type inference system for a language with object-oriented features such as polymorphic record access and subtyping. We separate the notion of matching and subtyping in order to avoid di culties caused by recursive type constraints. We will use two kinds of type constraints | record (variant) constraints and subtyping constraints. Then, we discuss simpli cation of such mixed type co...

متن کامل

Type Equivalence, Subtyping, and Type Transformations in Object-oriented Databases Type Equivalence, Subtyping, and Type Transformations in Object-oriented Databases

In this report, a number of completeness results are given that are useful for database integration on the schema level and the instance level. Type equivalence and subtyping are proven sound and complete w.r.t. a model-theoretic semantics. Furthermore, a set of type transformations is introduced that is proven sound and complete w.r.t. data capacity. These completeness results imply that if da...

متن کامل

A Uni ed Constraint Model for XML

Integrity constraints are an essential part of modern schema de nition languages. They are useful for semantic speci cation, update consistency control, query optimization, etc. In this paper, we propose UCM, a model of integrity constraints for XML that is both simple and expressive. Because it relies on a single notion of keys and foreign keys, the UCMmodel is easy to use and makes formal rea...

متن کامل

Behavioral Subtyping in Object-Oriented Languages

Modularity and code reuse are two important features of object-oriented programming. Modularity means that adding new components does not require reveri cation or respeci cation of existing components. A common form of reuse in objectoriented programs is to add new subtypes to existing types and to invoke already existing procedures with objects of these new types. In such cases, behavior of pr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996